Lower bound for the Complexity of the Boolean Satisfiability Problem
نویسنده
چکیده
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery for an extreme case is presented to determine a stable complexity around 2n. The reformulation point out that the decision Boolean Satisfiability Problem can only be solved in exponential time. This implies there is not an efficient algorithm for the NP Class. Algorithms, Complexity, SAT, NP, Quantum Computation. 68Q10, 68Q12,68Q19,68Q25.
منابع مشابه
A Lower Bound of 2n Conditional Branches for Boolean Satisfiability on Post Machines
We establish a lower bound of 2 conditional branches for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of n variables a set containing a Boolean formula to represent each Boolean function of n variables. The contradiction proof first assumes that there exists a Post machine (Post’s Formulation 1) that corr...
متن کاملA Lower Bound for Boolean Satisfiability on Turing Machines
We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of n variables a set containing a Boolean formula to represent each Boolean function of n variables. The contradiction proof first assumes that there exists a Turing machine with k symbols in its tape alphabet that correctly decid...
متن کاملBeating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity
We study algorithms for the satisfiability problem for quantified Boolean formulas (QBFs), and consequences of faster algorithms for circuit complexity. • We show that satisfiability of quantified 3-CNFs with m clauses, n variables, and two quantifier blocks (one existential block and one universal) can be solved deterministically in time 2n−Ω( √ n) · poly(m). For the case of multiple quantifie...
متن کاملA novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two operations: expansion and simplification are used to explains why using algebra grows the resolution steps. It is proved that its complexity has an upper bou...
متن کاملA Solution of the P versus NP Problem
Berg and Ulfberg and Amano and Maruoka have used CNF-DNF-approximators to prove exponential lower bounds for the monotone network complexity of the clique function and of Andreev's function. We show that these approximators can be used to prove the same lower bound for their non-monotone network complexity. This implies P not equal NP.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1602.06867 شماره
صفحات -
تاریخ انتشار 2016